Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem

Local Search Embedded in a Reoptimization Framework for the 0-1 Bidimensional Knapsack Lagrangean Dual

Heuristics for multiple knapsack problem

The Multiple Knapsack problem (MKP) is a hard combinatorial optimization problem with large application, which embraces many practical problems from different domains, like cargo loading, cutting stock, bin-packing, financial and other management, etc. It also arise as a subproblem in several more complex problems like vehicle routing problem and the algorithms to solve these problems will bene...

Reoptimization in lagrangian methods for the quadratic knapsack problem

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

Joint Performance of Greedy Heuristics for the Integer Knapsack Problem

This paper analyzes the worst-case performance of combinations of greedy heuristics for the integer knapsack problem. If the knapsack is large enough to accomodate at least m units of any item, then the joint performance of the total-value and density-ordered greedy heuristics is no smaller than (m + l)/(m + 2). For combinations of greedy heuristics that do not involve both the density-ordered ...